Double greedy algorithms: Reduced basis methods for transport dominated problems
نویسندگان
چکیده
منابع مشابه
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. Abstractly, it can be viewed as determining a “good” n dimensional space Hn to be used in approximating the elements of a compact set F in a Hilbert space H. One, by now popular, computational approach is to find Hn through a greedy ...
متن کاملGreedy stochastic algorithms for entropy-regularized optimal transport problems
Optimal transport (OT) distances are finding evermore applications in machine learning and computer vision, but their wide spread use in larger-scale problems is impeded by their high computational cost. In this work we develop a family of fast and practical stochastic algorithms for solving the optimal transport problem with an entropic penalization. This work extends the recently developed Gr...
متن کاملCertified Reduced Basis Methods for Parametrized Distributed Optimal Control Problems∗
In this paper, we consider the efficient and reliable solution of distributed optimal control problems governed by parametrized elliptic partial differential equations. The reduced basis method is used as a low-dimensional surrogate model to solve the optimal control problem. To this end, we introduce reduced basis spaces not only for the state and adjoint variable but also for the distributed ...
متن کاملReduced Basis Multiscale Finite Element Methods for Elliptic Problems
JAN S. HESTHAVEN ∗, SHUN ZHANG † , AND XUEYU ZHU ‡ Abstract. In this paper, we propose reduced basis multiscale finite element methods (RB-MsFEM) for elliptic problems with highly oscillating coefficients. The method is based on multiscale finite element methods with local test functions that encode the oscillatory behavior ([4, 14]). For uniform rectangular meshes, the local oscillating test f...
متن کاملReduced-basis output bound methods for parabolic problems
In this paper, we extend reduced-basis output bound methods developed earlier for elliptic problems, to problems described by parametrized parabolic partial differential equations. The essential new ingredient and the novelty of this paper consist in the presence of time in the formulation and solution of the problem. First, without assuming a time discretization, a reduced-basis procedure is p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2014
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an/2013103